Polynomial algorithms for computing the isolated toughness of interval and split graphs

The isolated toughness of a noncomplete graph G is defined as: , where C(G) the collection all vertex cutsets and i(G − Y) stands for number vertices in Y. If complete graph, we set . This parameter closely related to existence factors fractional graphs. These are well-studied within theory, have various applications several fields computer science. In this article, pay our attention computational complexity computing toughness. We present polynomial algorithms exact value interval graphs split graphs, two special classes.